Automated Answer-Checker

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated Resource Allocation in Business Processes with Answer Set Programming

Human resources are of central importance for executing and supervising business processes. An optimal resource allocation can dramatically improve undesirable consequences of resource shortages. However, existing approaches for resource allocation have some limitations, e.g., they do not consider concurrent process instances or loops in business processes, which may greatly alter resource requ...

متن کامل

Effective Feature Integration for Automated Short Answer Scoring

A major opportunity for NLP to have a realworld impact is in helping educators score student writing, particularly content-based writing (i.e., the task of automated short answer scoring). A major challenge in this enterprise is that scored responses to a particular question (i.e., labeled data) are valuable for modeling but limited in quantity. Additional information from the scoring guideline...

متن کامل

Automated Reasoning about XACML 3.0 Delegation Using Answer Set Programming

XACML is an XML-based declarative access control language standardized by OASIS. Its latest version 3.0 has several new features including the concept of delegation for decentralized administration of access control. Though it is important to avoid unintended consequences of ill-designed policies, delegation makes formal analysis of XACML policies highly complicated. In this paper, we present a...

متن کامل

Automated Selection of Grounding Algorithm in Answer Set Programming

Answer Set Programming (ASP) is a powerful language for knowledge representation and reasoning. ASP is exploited in real-world applications and is also attracting the interest of industry thanks to the availability of efficient implementations. ASP systems compute solutions relying on two modules: a grounder that produces, by removing variables from the rules, a ground program equivalent to the...

متن کامل

The Computational Complexity of Automated Redistricting: Is Automation the Answer?

Ronald Reagan and Justice Brennan have both suggested that computers can remove the controversy and politics from redistricting. ' In fact proponents of automated redistricting claim that the "optimal" districting plan can be determined, given any set of specified values. The Supreme Court has expressed a similar sentiment by addressing such mechanical principles as contiguity and compactness i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: December 2020

سال: 2020

ISSN: 2455-3778

DOI: 10.46501/ijmtst061229